ar X iv : 1 10 5 . 55 22 v 1 [ m at h . C O ] 2 7 M ay 2 01 1 The largest n − 1 Hosoya indices of unicyclic graphs ∗
نویسندگان
چکیده
The Hosoya index Z(G) of a graph G is defined as the total number of edge independent sets of G. In this paper, we extend the research of [J. Ou, On extremal unicyclic molecular graphs with maximal Hosoya index, Discrete Appl. Math. 157 (2009) 391–397.] and [Y. Ye, X. Pan, H. Liu, Ordering unicyclic graphs with respect to Hosoya indices and Merrifield-Simmons indices, MATCH Commun. Math. Comput. Chem. 59 (2008) 191–202.] and order the largest n− 1 unicyclic graphs with respect to the Hosoya index.
منابع مشابه
ar X iv : a st ro - p h / 05 05 55 5 v 1 2 7 M ay 2 00 5 Pulsars as Tools for Fundamental Physics & Astrophysics
X iv :a st ro -p h/ 05 05 55 5v 1 2 7 M ay 2 00 5 Pulsars as Tools for Fundamental Physics & Astrophysics J. M. Cordes, M. Kramer, T. J. W. Lazio , B. W. Stappers, D. C. Backer, S. Johnston Department of Astronomy and NAIC, Cornell University, Ithaca, NY USA University of Manchester, Jodrell Bank Observatory, Jodrell Bank, UK Naval Research Laboratory, Remote Sensing Division, Washington, DC US...
متن کاملar X iv : 0 90 5 . 27 40 v 1 [ m at h . C O ] 1 7 M ay 2 00 9 Graphs with many ± 1 or ± √ 2 eigenvalues
A pseudo (v, k, λ)-design is a pair (X,B) where X is a v-set and B = {B1, . . . , Bv−1} is a collection of k-subsets (blocks) of X such that each two distinct Bi, Bj intersect in λ elements; and 0 < λ < k < v − 1. We use the notion of pseudo designs to characterize graphs of order n whose spectrum contains either ±1 or ± √ 2 with multiplicity (n − 2)/2 or (n− 3)/2. It turns out that the subdivi...
متن کاملar X iv : m at h / 01 05 23 2 v 1 [ m at h . N T ] 2 8 M ay 2 00 1 MODULAR CURVES OF GENUS 2
We prove that there are exactly 149 genus two curves C defined over Q such that there exists a nonconstant morphism π : X 1 (N) → C defined over Q and the jacobian of C is Q-isogenous to the abelian variety A f attached by Shimura to a newform f ∈ S 2 (Γ 1 (N)). We determine the corresponding newforms and present equations for all these curves.
متن کاملar X iv : 1 10 5 . 38 75 v 1 [ co nd - m at . su pr - c on ] 19 M ay 2 01 1 Tunnel Spectroscopy of a Proximity Josephson Junction
متن کامل
ar X iv : m at h / 04 10 21 7 v 1 [ m at h . C O ] 8 O ct 2 00 4 Joints in graphs
In 1969 Erd˝ os proved that if r ≥ 2 and n > n0 (r) , every graph G of order n and e (G) > tr (n) has an edge that is contained in at least n r−1 / (10r) 6r (r + 1)-cliques. In this note we improve this bound to n r−1 /r r+5. We also prove a corresponding stability result.
متن کامل